Complexity function - PDFSEARCH.IO - Document Search Engine

Complexity function
Results: 282

#	Item
21	Differentially Private Integer Partitions and their Applications Jeremiah Blocki Microsoft Research Abstract Given a positive integer N ≥ 0 a partition of N is a non-increasing sequence of numbers x1 ≥ x2 . . . ≥ x Add to Reading List Source URL: tpdp16.cse.buffalo.edu Language: English - Date: 2016-06-08 10:11:54 Information privacy Exponentials Analysis of algorithms Applied probability Exponential mechanism Differential privacy Time complexity Password Exponential time hypothesis Partition Algorithm Exponential function
22	Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values Benjamin Mood Yale University Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2014-08-25 10:31:08 Circuit complexity Complexity classes Secure multi-party computation Computational complexity theory Digital circuits Circuit Boolean circuit CC Hash function NC
23	Reuse It Or Lose It: More Efficient Secure Computation Through Reuse of Encrypted Values Benjamin Mood Yale University Add to Reading List Source URL: work.debayangupta.com Language: English - Date: 2014-08-25 13:51:41 Circuit complexity Complexity classes Secure multi-party computation Computational complexity theory Digital circuits Circuit Boolean circuit CC Hash function NC
24	Complexity of the Bollob´ as-Riordan Polynomial Exceptional Points and Uniform Reductions Markus Bl¨ asera , Holger Dellb,⋆ , and Johann A. Makowskyc,⋆⋆ a Add to Reading List Source URL: www-cc.cs.uni-saarland.de Language: English - Date: 2012-05-16 12:01:50 Polynomials Tutte polynomial Chromatic polynomial Matching polynomial Rational function BollobsRiordan polynomial Discriminant
25	From Convex Optimization to Randomized Mechanisms: Toward Optimal Combinatorial Auctions∗ Shaddin Dughmi† Tim Roughgarden‡ Add to Reading List Source URL: www-bcf.usc.edu Language: English - Date: 2011-10-07 01:19:59 Operations research Linear programming Convex optimization Combinatorial optimization Computational complexity theory Submodular set function Randomized rounding Optimization problem Matroid Ellipsoid method Mathematical optimization Mechanism design
26	Secure Multiparty Computation of Approximations∗ Joan Feigenbaum† Yuval Ishai‡ Martin J. Straussk Add to Reading List Source URL: www.cs.yale.edu Language: English - Date: 2006-09-25 10:55:42 Quantum complexity theory Computational complexity theory Cryptography Functions and mappings Secure multi-party computation Secure two-party computation Communication complexity Limit of a function Pi Cryptographic protocol PP Approximation algorithm
27	PAC Learning and Artificial Neural Networks Martin Anthony and Norman Biggs Department of Mathematics, London School of Economics and Political Science (University of London), Houghton St., London WC2A 2AE, United Kingdo Add to Reading List Source URL: www.maths.lse.ac.uk Language: English - Date: 2000-04-03 14:19:07 Computational learning theory Artificial neural networks Machine learning Computational statistics Learning VC dimension Sample complexity Probably approximately correct learning Backpropagation Perceptron Vladimir Vapnik Radial basis function network
28	Lattice Points, Polyhedra, and Complexity Alexander Barvinok IAS/Park City Mathematics Series Volume , 2004 Add to Reading List Source URL: www.math.lsa.umich.edu Language: English - Date: 2004-11-01 10:23:42 Polyhedron Functions and mappings Algebraic varieties Euler characteristic Integer points in convex polyhedra Limit of a function Lattice Rational function Series Regular polyhedron
29	A quantitative version of a theorem due to Borwein-Reich-Shafrir Ulrich Kohlenbach BRICS∗ Department of Computer Science University of Aarhus Add to Reading List Source URL: www.mathematik.tu-darmstadt.de Language: English - Date: 2012-11-16 09:11:27 Mathematics Circuit complexity NC Banach fixed-point theorem Auxiliary function Differential forms on a Riemann surface
30	Journal of Machine Learning Research2801 Submitted 1/08; Revised 9/08; PublishedRobust Submodular Observation Selection Andreas Krause Add to Reading List Source URL: select.cs.cmu.edu Language: English - Date: 2009-08-13 03:47:05 Computational complexity theory Theory of computation Mathematics Submodular set function Greedy algorithm Algorithm Optimization problem Reduction NP Time complexity

UPDATE